Deterministic Batch Scheduling without Static Partitioning
نویسندگان
چکیده
The Irix 6.5 scheduling system provides intrinsic support for batch processing, including support for guaranteed access to resources and policy-based static scheduling. Long range scheduling decisions are made by Miser, a user level daemon, which reserves the resources needed by a batch job to complete its tasks. Short-term decisions are made by the kernel in accordance with the reservations established by Miser. Unlike many batch systems, the processes in a batch job remain in the system from the time originally scheduled until the job completes. This gives the system considerable exibility in choosing jobs to use idle resources. Unreserved or reserved but unused resources are available to either interactive jobs or batch jobs that haven't yet been scheduled. The system thus gains the advantages of static partitioning and static scheduling, without their inherent costs.
منابع مشابه
Campaign Planning and Scheduling for Multiproduct Batch Operations with Applications to the Food-Processing Industry
W analyze planning and scheduling of multiproduct batch operations in the food-processing industry. Such operations are encountered in many applications including manufacturing of sorbitol, modified starches, and specialty sugars. Unlike discrete manufacturing, batch sizes in these operations cannot be set arbitrarily, but are often determined by equipment size. Multiple batches of the same pro...
متن کاملQuasi-Static Scheduling for Multiprocessor DSP
Scheduliig strategies for multiprocessor DSP are classified into four types: fully-dynamic, static-assignment, self-timed, and fully-static. The concept of static scheduling (self-timed or fullystatic) is extended to handle non-deterministic actors in the proposed quasi-static scheduling. Quasi-static scheduling minimizes run-time overhead with increased compilation complexity, thus adequate fo...
متن کاملScheduling Simulations: An Experimental Approach to Time-Sharing Multiprocessor Scheduling Schemes
Real time systems that are logically programmed for scientific applications involve frequent job arrivals, thus requires a parallel architecture, so that maximum applications can be executed simultaneously resulting in less waiting time and maximum resource utilization. This must be achieved by workload partitioning & characterization, directs towards the development of Multiprocessor machines,...
متن کاملA Stochastic Batching and Scheduling Problem
We consider a batch scheduling problem in which the processing time of a batch of jobs equals the maximum of the processing times of all jobs in the batch. This is the case, for example, for burn-in operations in semiconductor manufacturing, and other testing operations. Processing times are assumed to be random, and we consider minimizing the makespan and the flowtime. The problem is much more...
متن کاملScheduling for hardware/software partitioning in embedded system design
I present a new approach that solves the hardware-software partitioning problem for small embedded systems. Small application specific digital systems, often referred to as embedded systems, are often implemented using both hardware and software. Due to the impact that the hardware-software partition of the system functionality has on the system performance and cost, determining an optimal or n...
متن کامل